Reasoning with Temporal Logic on Truncated Paths
نویسندگان
چکیده
We consider the problem of reasoning with linear temporal logic on truncated paths. A truncated path is a path which is finite, but not necessarily maximal. Truncated paths arise naturally in several areas, among which are incomplete verification methods (such as simulation or bounded model checking) and hardware resets. We present a formalism for reasoning about truncated paths, and analyze its characteristics.
منابع مشابه
Automata Construction for PSL
The language PSL [1] is a temporal logic standardized by the Accellera standards organization and currently undergoing the process of becoming an IEEE standard. The core of PSL, denoted here LTL WR, is an extension of the linear temporal logic LTL. The extension takes two orthogonal directions. In one direction the logic is interpreted over finite, possibly truncated, as well as infinite words....
متن کاملVerifying Social Expectations by Model Checking Truncated Paths
One approach to moderating the expected behaviour of agents in open societies is the use of explicit languages for defining norms, conditional commitments and/or social expectations, together with infrastructure supporting conformance checking. This paper presents a logical account of the fulfilment and violation of social expectations modelled as conditional rules over a hybrid linear proposit...
متن کاملThe >, ⊥ approach for truncated semantics
In previous work [1] we argue that in order for temporal logic to be useful in incomplete verification methods such as simulation or bounded model checking, it is necessary to define semantics over truncated paths. A truncated path is a path which is finite, but not necessarily maximal. The semantics on truncated paths is based on three views: the weak view, the neutral view and the strong view...
متن کاملProbabilistic Model Checking on Propositional Projection Temporal Logic
Propositional Projection Temporal Logic (PPTL) is a useful formalism for reasoning about period of time in hardware and software systems and can handle both sequential and parallel compositions. In this paper, based on discrete time Markov chains, we investigate the probabilistic model checking approach for PPTL towards verifying arbitrary linear-time properties. We first define a normal form g...
متن کاملDocument Verification with Temporal Description Logics
The subject of this thesis is checking the content consistency of web documents along reading paths. Web documents are typically not read linearly but by following different alternative paths through the content. Manually ensuring the consistency of content along the possible reading paths is difficult, time-consuming, and error-prone. Tool support is highly desirable. This thesis presents a ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003